An Algorithm to Automatically Detect the Smale Horseshoes
نویسندگان
چکیده
منابع مشابه
An Algorithm to Automatically Detect the Smale Horseshoes
Smale horseshoes, curvilinear rectangles and their U-shaped images patterned on Smale’s famous example, provide a rigorous way to study chaos in dynamical systems. The paper is devoted to constructing them in two-dimensional diffeomorphisms with the existence of transversal homoclinic saddles. We first propose an algorithm to automatically construct “horizontal” and “vertical” sides of the curv...
متن کاملSmale Horseshoes and Symbolic Dynamics in Perturbed Nonlinear Schrödinger Equations
In [12], we gave an intensive study on the level sets of the integrable cubic nonlinear Schrödinger (NLS) equation. Based upon that study, the existence of a symmetric pair of homoclinic orbits in certain perturbed NLS systems was established in [11]. [Stated in Theorem 1.3 below.] In this paper, the existence of Smale horseshoes and symbolic dynamics is established in the neighborhood of the s...
متن کاملAn algorithm to detect laminar 3-manifolds
We show that there are algorithms to determine if a 3-manifold contains an essential lamination or a Reebless foliation. AMS Classification numbers Primary: 57M50
متن کاملQuantum and classical echoes in scattering systems de - scribed by simple Smale horseshoes
PACS. 05.45.Mt – Semiclassical chaos (" quantum chaos "). Abstract. – We explore the quantum scattering of systems classically described by binary and other low order Smale horseshoes, in a stage of development where the stable island associated with the inner periodic orbit is large, but chaos around this island is well developed. For short incoming pulses we find periodic echoes modulating an...
متن کاملAn Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations
Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2012
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2012/283179